The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides

نویسندگان

  • Saeed Karimi
  • Faezeh Toutounian
چکیده

In this paper, we present the block least squares method for solving nonsymmetric linear systems with multiple righthand sides. This method is based on the block bidiagonalization. We first derive two algorithms by using two different convergence criteria. The first one is based on independently minimizing the 2-norm of each column of the residual matrix and the second approach is based on minimizing the Frobenius norm of residual matrix. We then give some properties of these new algorithms. Finally, some numerical experiments on test matrices from Harwell–Boeing collection are presented to show the efficiency of the new method. 2005 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

Block Bidiagonalization Methods for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides

Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying an iterative method to each of these systems individually, it is often more eecient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose block versions of Galerkin/minimal residual pair of bidiagonal...

متن کامل

Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$

In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...

متن کامل

Smoothing iterative block methods for linear systems with multiple right-hand sides

In the present paper, we present smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known when solving one right-hand linear systems. We give some properties of these new methods and then, using these procedures we show connections between some known iterative block methods. Fina...

متن کامل

A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides

The block GMRES (BGMRES) method is a natural generalization of the GMRES algorithm for solving large nonsymmetric systems with multiple right-hand sides. Unfortunately, its cost increases significantly per iteration, frequently rendering the method impractical. In this paper we propose a hybrid block GMRES method which offers significant performance improvements over BGMRES. This method uses th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 177  شماره 

صفحات  -

تاریخ انتشار 2006